A Theory of Metric Labelled Transition Systems
نویسنده
چکیده
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models deened by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition systems with the conngurations and actions endowed with metrics. The additional metric structure allows us to generalize the theory developed by Kok and Rutten.
منابع مشابه
Metrics for Action - labelled Quantitative Transition Systems 1 Yuxin
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric corresponds to a bisimulation and that the greatest state-metric corresponds to bisimilarity. Fu...
متن کاملMetrics for Action - labelled Quantitative Transition Systems 1
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric corresponds to a bisimulation and that the greatest state-metric corresponds to bisimilarity. Fu...
متن کاملReportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...
متن کاملGeneralized Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the con gurations and the labels with a complete metric In this way a so called metric labelled transition system is obtained The additional structure on a metric labelled transition systemmakes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image com...
متن کاملBisimulation for Labelled Markov Processes
In this paper we introduce a new class of labelled transition systems Labelled Markov Processes and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995